Efficient Verification of the PCI Local Bus using Boolean Satisfiability
نویسندگان
چکیده
The purpose of this paper is to study the application of Boolean Satisfiability to the verification of the PCI Local Bus. The novel feature of this approach is the generation of several propositional formulas that describe the specification of the bus system. The formulas are tested using a powerful SAT solver and the bus is verified for errors. The SAT-based approach has several important advantages over conventional BDD-based approaches such as achieving high speed testing. To demonstrate how our method works, we have modeled the PCI Local Bus and verified several properties.
منابع مشابه
Formal Verification of the PCI Local Bus: A Step Towards IP Core Based System-On-Chip Design Verification
We describe a methodology for verifying system-on-chip designs. In our methodology, the problem of verifying system-on-chip designs is decomposed into three tasks. First, we verify, once and for all, the standard bus interconnecting IP Cores in the system. The next task is to verify the glue logic, which connects the IP Cores to the buses. Finally, using the verified bus protocols and the IP co...
متن کاملVerifying IP-Core based System-On-Chip Designs
We describe a methodology for verifying system-on-chip designs. In our methodology, the problem of verifying system-on-chip designs is decomposed into three tasks. First, we verify, once and for all, the standard bus interconnecting IP Cores in the system . The next task is to verify the glue logic, which connects the IP Cores to the buses. Finally, using the verified bus protocols and the IP c...
متن کاملSatisfiability Solving for Program Verification: towards the Efficient Combination of Automated Theorem Provers and Satisfiability Modulo Theory Tools
Many approaches to software verification require to check the satisfiability of first-order formulae. For such techniques, it is of crucial importance to have satisfiability solvers which are both scalable, predictable and flexible. We describe our approach to build solvers satisfying such requirements by combining equational theorem proving, Boolean solving, Arithmetic reasoning, and some tran...
متن کاملAbstract BDDs: A Technique for Using Abstraction in Model Checking
BDDs: A Technique for Using Abstraction in Model Checking Edmund Clarke, Somesh Jha, Yuan Lu, and Dong Wang Carnegie Mellon University, Pittsburgh, PA 15213, USA {emc,sjha,yuanlu,dongw}@cs.cmu.edu Abstract. We propose a new methodology for exploiting abstraction in the context of model-checking. Our new technique uses abstract BDDs as its underlying data structure. We show that this technique b...
متن کاملSurvey of Techniques for Efficient Solving of Boolean Formulas from Formal Verification of Pipelined, Superscalar, and VLIW Microprocessors at a High Level of Abstraction
In 2000 – 2003, the author made publicly available a collection of more than 1,100 Boolean formulas generated in formal verification of complex pipelined, superscalar, and VLIW microprocessors. These formulas galvanized the Boolean Satisfiability (SAT) community, and were used for the development of all recent academic and industrial SAT solvers. The paper evaluates the efficiency of various te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000